an efficient protocol for data aggregation in wireless sensor networks

sensor networks generally consist of a very great number of sensor nodes which will be spread into a vast environment and aggregate data out of it. the sensor nodes are afflicted with some limitations as follows memory, reception, communication as well as calculation capability, and battery power. the transmission of a great amount of extra data increases data transmission and proportionally increases the amount of energy and bandwidth for the data transmission. one solution for this issue is data aggregation. the results of aggregated data influence the accuracy and precision of the final result already gleaned from the base station. the main challenge in such networks is how to further elongate the network lifetime and among the factors doing so is the energy consumption or energy optimization. the clustering is one apt method in place for furthering the network life span. respectively the clustering protocols have come up with a suitable method for the so called challenge or more simply put increasing the lifetime. in this paper the researchers attempt to bring forth yet another efficient protocol for data aggregation hinging around clustering which uses maximum residual energy and minimum distance for selecting the cluster-head to reduce the consumption of energy. the experimental results point to this very fact that energy-efficient clustering algorithm through residual energy and average distance (eeca-read) attains very good performance.